#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"
using PII = pair<int, int>;
using TII = tuple<int, int, int>;
#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define BSI basic_string<int>
#define BSPI basic_string<PII>
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define VI vector<int>
#define VII vector<vector<int>>
#define VPII vector<PII>
#define lowbit(x) ((x)&(-x))
#define RE return;
#define RET return true;
#define REF return false;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define fi first
#define se second
#define sz size()
constexpr int N = 2e5 + 10;
constexpr int mod = 998244353;

int __FAST_IO__ = [](){
    ios::sync_with_stdio(0), cin.tie(0);
    cout.tie(0);
    cout << fixed << setprecision(12);
    return 0;
}();

string s;
bool vis[10][10];
int ans;

void dfs(int u,int x,int y){
    vis[x][y]=1;
    if(vis[x+1][y]&&vis[x-1][y]&&!vis[x][y+1]&&!vis[x][y-1])RE;
    if(!vis[x+1][y]&&!vis[x-1][y]&&vis[x][y+1]&&vis[x][y-1])RE;
    if(x==7&&y==1){
        if(u==48)ans++;
        RE;
    }

    if(s[u]=='L'){
        if(!vis[x][y-1]){
            dfs(u+1,x,y-1);
            vis[x][y-1]=0;
        }
    }else if(s[u]=='R'){
        if(!vis[x][y+1]){
            dfs(u+1,x,y+1);
            vis[x][y+1]=0;
        }
    }else if(s[u]=='D'){
        if(!vis[x+1][y]){
            dfs(u+1,x+1,y);
            vis[x+1][y]=0;
        }
    }else if(s[u]=='U'){
        if(!vis[x-1][y]){
            dfs(u+1,x-1,y);
            vis[x-1][y]=0;
        }
    }else{
        if(!vis[x][y-1]){
            dfs(u+1,x,y-1);
            vis[x][y-1]=0;
        }
        if(!vis[x][y+1]){
            dfs(u+1,x,y+1);
            vis[x][y+1]=0;
        }
        if(!vis[x+1][y]){
            dfs(u+1,x+1,y);
            vis[x+1][y]=0;
        }
        if(!vis[x-1][y]){
            dfs(u+1,x-1,y);
            vis[x-1][y]=0;
        }
    }
}

void solve() {
    cin>>s;

    FOR(i,0,7){
        vis[0][i]=vis[i][0]=vis[8][i]=vis[i][8]=1;
    }
    dfs(0,1,1);

    cout<<ans;
}

signed main() {
    int Task = 1;
    for (; Task; Task--) {
        solve();
    }
    return 0;
}